The shape theorem for the frog model ∗
نویسنده
چکیده
In this work we prove a shape theorem for a growing set of Simple Random Walks (SRWs) on Z d , known as frog model. The dynamics of this process is described as follows: There are active particles, which perform independent SRWs, and sleeping particles, which do not move. When a sleeping particle is hit by an active particle, it becomes active too. At time 0 all particles are sleeping, except for that placed at the origin. We prove that the set of the original positions of all the active particles, rescaled by the elapsed time, converges to some compact convex set. In some specific cases we are able to identify (at least partially) this set.
منابع مشابه
Numerical Meshless Method in Conjunction with Bayesian Theorem for Electrical Tomography of Concrete
Electric potential measurement technique (tomography) was introduced as a nondestructive method to evaluate concrete properties and durability. In this study, numerical meshless method was developed to solve a differential equation which simulates electric potential distribution for concrete with inclusion in two dimensions. Therefore, concrete samples with iron block inclusion in different loc...
متن کاملStudy of Solar Magnetic and Gravitational Energies Through the Virial Theorem
Virial theorem is important for understanding stellar structures. It produces an interesting connection between magnetic and gravitational energies. Using the general form of the virial theorem including the magnetic field (toroidal magnetic field), we may explain the solar dynamo model in relation to variations of the magnetic and gravitational energies. We emphasize the role of the gravitatio...
متن کاملThe shape theorem for the frog model with random initial configuration
We prove a shape theorem for a growing set of simple random walks on Z d , known as frog model. The dynamics of this process is described as follows: There are active particles, which perform independent discrete time SRWs, and sleeping particles, which do not move. When a sleeping particle is hit by an active particle, the former becomes active as well. Initially, a random number of particles ...
متن کاملGenetic and Improved Shuffled Frog Leaping Algorithms for a 2-Stage Model of a Hub Covering Location Network
Hub covering location problem, Network design, Single machine scheduling, Genetic algorithm, Shuffled frog leaping algorithm Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc....
متن کاملVoltage Flicker Parameters Estimation Using Shuffled Frog Leaping Algorithm and Imperialistic Competitive Algorithm
Measurement of magnitude and frequency of the voltage flicker is very important for monitoring andcontrolling voltage flicker efficiently to improve the network power quality. This paper presents twonew methods for measurement of flicker signal parameters using Shuffled Frog Leaping Algorithm(SFLA) and Imperialist Competitive Algorithm (ICA). This paper estimates fundamental voltage andflicker ...
متن کامل